Central limit theorems for patterns in multiset permutations and set partitions
نویسندگان
چکیده
منابع مشابه
Erdos-Ko-Rado theorems for permutations and set partitions
Let Sym([n]) denote the collection of all permutations of [n] = {1, . . . , n}. Suppose A ⊆ Sym([n]) is a family of permutations such that any two of its elements (when written in its cycle decomposition) have at least t cycles in common. We prove that for sufficiently large n, |A| ≤ (n− t)! with equality if and only if A is the stabilizer of t fixed points. Similarly, let B(n) denote the colle...
متن کاملCentral Limit Theorems for Some Set Partition Statistics
We prove the conjectured limiting normality for the number of crossings of a uniformly chosen set partition of [n] = {1, 2, . . . , n}. The arguments use a novel stochastic representation and are also used to prove central limit theorems for the dimension index and the number of levels.
متن کاملAvoiding Patterns of Length Three in Compositions and Multiset Permutations
We find generating functions for the number of compositions avoiding a single pattern or a pair of patterns of length three on the alphabet {1, 2} and determine which of them are Wilf-equivalent on compositions. We also derive the number of permutations of a multiset which avoid these same patterns and determine the Wilf-equivalence of these patterns on permutations of multisets. 2000 Mathemati...
متن کاملA Central Limit Theorem for Integer Partitions
Abstract. Recently, Hwang proved a central limit theorem for restricted Λ-partitions, where Λ can be any nondecreasing sequence of integers tending to infinity that satisfies certain technical conditions. In particular, one of these conditions is that the associated Dirichlet series has only a single pole on the abscissa of convergence. In the present paper, we show that this condition can be r...
متن کاملLimit Theorems for the Number of Summands in Integer Partitions
Central and local limit theorems are derived for the number of distinct summands in integer partitions, with or without repetitions, under a general scheme essentially due to Meinardus. The local limit theorems are of the form of Cramér-type large deviations and are proved by Mellin transform and the two-dimensional saddle-point method. Applications of these results include partitions into posi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2020
ISSN: 1050-5164
DOI: 10.1214/19-aap1502